Technology Mapping for FPGA Using Generalized Functional Decomposition
نویسندگان
چکیده
منابع مشابه
Unified functional decomposition via encoding for FPGA technology mapping
Functional decomposition has recently been adopted for look-up tabel (LUT)-based field-programmable gate array (FPGA) technology mapping with good results. In this paper we propose a novel method to unify functional single-output and multiple-output decomposition. We first address a compatible class encoding algorithm to minimize the number of compatible classes in the image function. After app...
متن کاملParallel Performance Directed Technology Mapping for Fpga
An eecient distributed method is developped for the technology mapping of Look Up Table-based Field Programmable Gate Arrays. Parallelization shortens the design cycle time for rapid prototyping of large designs onto fpga. In our algorithm, the boolean network is partitionned using an eeective k-way partitioning tool, the subgraphs are synthesized for performance using the nominal delay predict...
متن کاملTechnology Mapping for the Atmel Fpga Circuits
In this paper we present a technology mapping algorithm for the ATMEL 6002 FPGA circuits. The algorithm tries to balance cell utilization with the goal of producing routable mappings. The complexity of the technology mapping step may be considerably reduced if the internal representation generation is very well conceived. We implemented a program for internal representation generation, which le...
متن کاملTechnology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition
Quantum computing offers a promising emerging technology due to the potential theoretical capacity of solving many important problems with exponentially less complexity. Since most of the known quantum algorithms include Boolean components, the design of quantum computers is often conducted by a two-stage approach. In a first step, the Boolean component is realized in reversible logic and then ...
متن کاملStructural Gate Decomposition for Depth-Optimal Technology Mapping in LUT-based FPGA
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the mapping solutions computed by a depth-optimal mapper have minimum depth. We present several theoretical results: (1) any further decomposition of a K-bounded network will lead to an optimal mapping depth smaller than or equal to that of the original network, regardless of the decompos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1994
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1994/56371